Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs
نویسندگان
چکیده
منابع مشابه
D-Spectrum and D-Energy of Complements of Iterated Line Graphs of Regular Graphs
The D-eigenvalues {µ1,…,µp} of a graph G are the eigenvalues of its distance matrix D and form its D-spectrum. The D-energy, ED(G) of G is given by ED (G) =∑i=1p |µi|. Two non cospectral graphs with respect to D are said to be D-equi energetic if they have the same D-energy. In this paper we show that if G is an r-regular graph on p vertices with 2r ≤ p - 1, then the complements of iterated lin...
متن کاملCompositions of Complements of Graphs
A connected partition of a graph G is a partition of its vertex set such that each induced subgraph is connected. In earlier research it was called a connected composition of a graph. We find a polynomial, the defect polynomial of the graph, that decribes the number of connected partitions of complements of graphs with respect to any complete graph. The defect polynomial is calculated for sever...
متن کاملOn recognition of threshold tolerance graphs and their complements
A graph G = (V,E) is a threshold tolerance graph if each vertex v ∈ V can be assigned a weight wv and a tolerance tv such that two vertices x, y ∈ V are adjacent if wx +wy ≥ min(tx, ty). Currently, the most efficient recognition algorithm for threshold tolerance graphs is the algorithm of Monma, Reed, and Trotter which has an O(n) runtime. We give an O(n) algorithm for recognizing threshold tol...
متن کاملStar complements and exceptional graphs
Let G be a finite graph of order n with an eigenvalue μ of multiplicity k. (Thus the μ-eigenspace of a (0, 1)-adjacency matrix of G has dimension k.) A star complement for μ in G is an induced subgraph G−X of G such that |X| = k and G−X does not have μ as an eigenvalue. An exceptional graph is a connected graph, other than a generalized line graph, whose eigenvalues lie in [−2,∞). We establish ...
متن کاملMaximum norms of graphs and their complements
Given a graph G; let kGk denote the trace norm of its adjacency matrix, also known as the energy of G: The main result of this paper states that if G is a graph of order n; then kGk + G (n 1) 1 +n ; where G is the complement of G: Equality is possible if and only if G is a strongly regular graph with parameters (n; (n 1) =2; (n 5) =4; (n 1) =4) ; known also as a conference graph. In fact, the a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2004
ISSN: 0166-218X
DOI: 10.1016/j.dam.2003.04.004